Generalization in Human Category Learning: A Connectionist Account of Differences in Gradient after Discriminative and Non discriminative Training
نویسنده
چکیده
Two experiments are reported that investigate the difference in g radient of generalization observed between one-category (non-d iscrim inative) and two-category (discrim inative) training. Extrapolating from the resu lts of a number of animal lear ning studies, it was predicted that the g radient should be steeper under discrim inative training. The ® rst experiment con ® rms this basic prediction for the stimuli used, which were novel, prototype-structured, and constructed from 12 symbols positioned on a g rid. An explanation for the effect, based on the Rescorla ± Wagner theory of Pavlovian conditioning (Rescorla & Wagner, 1972), is that under non-discrim inative train ing ``incidental stimuli’ ’ have signi ® cant control over responding, whereas under discrim inative train ing they do not. Incidental stimuli are those aspects of the stimulus, or the surrounding context, that are not differentia lly reinforced under discrim inative train ing. This explanation leads to the prediction that a comparable effec t of blocked versus interm ixed discrim inative train ing should also be found. This prediction is discon ® rmed by the second experiment. An alternative model, still based on the Rescorla ± Wagner theory but w ith the add ition of a decision mechanism comprising a threshold unit and a competitive network system, is proposed, and its ability to predict both the choice probabilities and the pattern of response times found is evaluated via simulation.
منابع مشابه
دو روش تبدیل ویژگی مبتنی بر الگوریتم های ژنتیک برای کاهش خطای دسته بندی ماشین بردار پشتیبان
Discriminative methods are used for increasing pattern recognition and classification accuracy. These methods can be used as discriminant transformations applied to features or they can be used as discriminative learning algorithms for the classifiers. Usually, discriminative transformations criteria are different from the criteria of discriminant classifiers training or their error. In this ...
متن کاملOnline Deep Learning: Growing RBM on the fly
We propose a novel online learning algorithm for Restricted Boltzmann Machines (RBM), namely, the Online Generative Discriminative Restricted Boltzmann Machine (OGD-RBM), that provides the ability to build and adapt the network architecture of RBM according to the statistics of streaming data. The OGD-RBM is trained in two phases: (1) an online generative phase for unsupervised feature represen...
متن کاملConfiguration Estimates Improve Pedestrian Finding
Fair discriminative pedestrian finders are now available. In fact, these pedestrian finders make most errors on pedestrians in configurations that are uncommon in the training data, for example, mounting a bicycle. This is undesirable. However, the human configuration can itself be estimated discriminatively using structure learning. We demonstrate a pedestrian finder which first finds the most...
متن کاملA Survey of Discriminative and Connectionist Methods for Speech Processing
Discriminative speech processing techniques attempt to compute the maximum a posterior probability of some speech event, such as a particular phoneme being spoken, given the observed data. Non-discriminative techniques compute the likelihood of the observed data assuming an event. Non-discriminative methods such as simple HMMs (hidden Markov models) achieved success despite their lack of discri...
متن کاملDiscriminative Learning of Generative Models for Sequence Classification and Motion Tracking
I consider the issue of learning generative probabilistic models (e.g., Bayesian Networks) for the problems of classification and regression. As the generative models now serve as target-predicting functions, the learning problem can be treated differently from the traditional density estimation. Unlike the likelihood maximizing generative learning that fits a model to overall data, the discrim...
متن کامل